Efficient Storage Scaling for MBR and MSR Codes

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Class of MSR Codes for Clustered Distributed Storage

Clustered distributed storage models real data centers where intraand cross-cluster repair bandwidths are different. In this paper, exact-repair minimum-storage-regenerating (MSR) codes achieving capacity of clustered distributed storage are designed. Focus is given on two cases: = 0 and = 1/(n−k), where is the ratio of the available crossand intra-cluster repair bandwidths, n is the total numb...

متن کامل

Explicit Construction of MBR Codes for Clustered Distributed Storage

Capacity of the distributed storage system (DSS) is often discussed in the context of tradeoff between storage overhead and repair bandwidth. This paper considers capacityachieving coding for the clustered form of distributed storage that reflects practical storage networks. The suggested coding scheme is shown to exactly regenerate the arbitrary failed node with minimum required bandwidth, i.e...

متن کامل

Hybrid Regenerating Codes for Distributed Storage Systems

Distributed storage systems are mainly justified due to their ability to store data reliably over some unreliable nodes such that the system can have long term durability. Recently, regenerating codes are proposed to make a balance between the repair bandwidth and the storage capacity per node. This is achieved through using the notion of network coding approach. In this paper, a new variation ...

متن کامل

LT Codes For Efficient and Reliable Distributed Storage Systems Revisited

LT codes and digital fountain techniques have received significant attention from both academics and industry in the past few years. There have also been extensive interests in applying LT code techniques to distributed storage systems such as cloud data storage in recent years. However, Plank and Thomason’s experimental results show that LDPC code performs well only asymptotically when the num...

متن کامل

Clay Codes: Moulding MDS Codes to Yield an MSR Code

With increase in scale, the number of node failures in a data center increases sharply. To ensure availability of data, failure-tolerance schemes such as ReedSolomon (RS) or more generally, Maximum Distance Separable (MDS) erasure codes are used. However, while MDS codes offer minimum storage overhead for a given amount of failure tolerance, they do not meet other practical needs of today’s dat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Access

سال: 2020

ISSN: 2169-3536

DOI: 10.1109/access.2020.2989822